Free surface flow over square bars at intermediate relative submergence
نویسندگان
چکیده
منابع مشابه
Threshold Submergence of Flow over PK Weirs
In this study an extensive experimental research is carried out to develop a better understanding of the effects of Piano Key (PK) weir geometry on weir flow threshold submergence. Experiments were conducted in a 12 m long, 0.4 m wide and 0.7 m deep rectangular glass wall flume. The main objectives were to investigate the effect of the PK weir geometries including the weir length, weir height, ...
متن کاملSteady free-surface flow over spatially periodic topography
Two-dimensional free-surface flow over a spatially periodic channel bed topography is examined using a steady periodically forced Korteweg–de Vries equation. The existence of new forced solitary-type waves with periodic tails is demonstrated using recently developed non-autonomous dynamical-systems theory. Bound states with two or more co-existing solitary waves are also identified. The solutio...
متن کاملBars in field and cluster galaxies at intermediate redshifts
We present the first study of large-scale bars in clusters at intermediate redshifts (z = 0.4 − 0.8). We compare the properties of the bars and their host galaxies in the clusters with those of a field sample in the same redshift range. We use a sample of 945 moderately inclined disk galaxies drawn from the EDisCS project. The morphological classification of the galaxies and the detection of ba...
متن کاملSquare-free Strings Over Alphabet Lists
We solve an open problem that was posed in [GKM10]: Given an alphabet list L = L1, . . . , Ln, where |Li| = 3 and 0 ≤ i ≤ n, can we always find a square-free string, W = W1W2 . . .Wn, where Wi ∈ Li? We show that this is indeed the case. We do so using an “offending suffix” characterization of forced repetitions, and a counting, non-constructive, technique. We discuss future directions related t...
متن کاملDecoding square-free Goppa codes over $\F_p$
We propose a new, efficient non-deterministic decoding algorithm for square-free Goppa codes over Fp for any prime p. If the code in question has degree t and the average distance to the closest codeword is at least (4/p)t+1, the proposed decoder can uniquely correct up to (2/p)t errors with high probability. The correction capability is higher if the distribution of error magnitudes is not uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Hydraulic Research
سال: 2018
ISSN: 0022-1686,1814-2079
DOI: 10.1080/00221686.2017.1413601